非椭圆扩展目标联合跟踪与分类算法

充分利用目标尺寸和形状信息,提出了一种基于星凸随机超曲面模型(random hypersurface model, RHM)的非椭圆扩展目标联合跟踪与分类(joint tracking and classification, JTC)算法。将目标空间扩展状态建模为星凸形状,通过目标类别相关先验信息的矢量化建模,建立起其与目标瞬时扩展状态的关系,并在统一的贝叶斯滤波框架下,实现跟踪与分类的一体化处理;进一步对目标运动学状态和扩展状态单独进行建模,并通过构建扩展状态的似然函数,利用粒子滤波实现目标类别概率算式的递推处理。仿真结果表明:与基于椭圆形状的扩展目标JTC算法相比,所提算法能对尺寸相近、形状不同的目标进行准确分类,同时可改善目标状态的估计效果;与基于星凸RHM的扩展目标跟踪算法相比,所提算法能大幅提高目标状态的估计性能。     

反潜机采用阿基米德螺旋线搜潜问题研究

反潜机是重要的反潜力量,根据反潜机搜潜情况,建立了反潜飞机采用阿基米德螺旋线样式搜潜的数学模型和目标运动模型,讨论了螺旋线采用的三种轨迹间隔,通过仿真验证,确立了反潜机搜潜最优轨迹间隔,以达到提高发现目标潜艇概率、优化反潜效能的目的,为反潜飞机采用阿基米德巡逻线搜潜样式搜潜时提供战术参考。     

对成像雷达的脉冲分段排序转发干扰

多假目标图像欺骗是目前宽带雷达干扰的难点。针对宽带雷达中常用的线性调频(Linear Frequency Modulated,LFM)信号,提出一种脉冲分段排序转发干扰方法。结合散射波信号模型,推导了合成干扰信号二维成像输出形式,讨论了假目标图像个数、分辨率与分段数以及转发次序之间的关系,并进行了仿真实验。结果表明该干扰方法可较便捷地产生多个沿距离向分布的假目标图像。结果对于成像雷达图像欺骗干扰具有理论指导意义。     

远程火炮密集度试验多组数据的处理方法

远程火炮密集度试验需要进行多次射击,同一试验条件下的多组数据通常认为来源于同一分布,但却未见于证明。利用统计检验方法,给出了对试验数据方差齐性及均值相等性的检验方法,并在多组试验数据一致性的基础上给出了试验数据均值、方差的无偏估计,同时在既定置信度下给出了其置信区间,为远程火炮精度检测提供了工具。     

舰炮火控雷达实测误差时序特性分析建模

针对舰炮火控雷达高精度实时仿真建模的问题,运用高斯分布和正态平稳过程的两种误差序列生成方法,建立火控雷达简化仿真模型。通过对某火控雷达实测数据误差的统计及时序相关性分析,完成误差序列仿真生成与验证,给出了实现舰炮火控雷达探测误差仿真的优选方法。实践证明,正态平稳模型的误差生成方法可以有效满足新型舰炮仿真试验火控雷达建模要求。     

基于脉冲控制的末修弹飞行稳定性研究

脉冲力的瞬间作用会引起攻角和侧滑角的急剧变化,对末修弹飞行稳定性产生较大的影响.以线性化运动微分方程组为数学解析手段,对末修弹脉冲作用稳定性进行深入分析研究.数值仿真表明,采用小扰动法分析弹丸脉冲控制弹丸飞行稳定性是可行的.     

基于维修器材离散随机需求最佳库存量确定研究

结合装备维修器材保障工作,就维修器材离散随机需求最佳库存量确定进行研究,对其建模进行系统分析,结合修理厂维修器材最佳库存量进行实例计算,以指导维修器材最佳库存量的确定.     

求解卷积公式的一种新方法

基于数形结合方法以及变量代换方法发现计算卷积公式存在某些不足之处,研究卷积公式的计算方法,给出一种新的确定积分限的方法.该方法直观明了、容易理解和掌握并且可操作性强,有效避免作图和分析图形的繁琐,并举例说明了该应用方法.     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

Inequality‐based reliability estimates for complex systems

Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013